The Scholten/Dijkstra Pebble Game Played Straightly, Distributedly, Online and Reversed
نویسنده
چکیده
The Scholten/Dijkstra “Pebble Game” is re-examined. We show that the algorithm lends itself to a distributed as well as an online version, and even to a reversed variant. Technically this is achieved by exploiting the local and the reversible nature of Petri Net transitions. Furthermore, these properties allow to retain the verification arguments of the algorithm.
منابع مشابه
Pebbling Meets Coloring: Reversible Pebble Game On Trees
The reversible pebble game is a combinatorial game played on rooted DAGs. This game was introduced by Bennett [1] motivated by applications in designing space efficient reversible algorithms. Recently, Siu Man Chan [2] showed that the reversible pebble game number of any DAG is the same as its Dymond-Tompa pebble number and Raz-Mckenzie pebble number. We show, as our main result, that for any r...
متن کاملRed-Blue and Standard Pebble Games: Complexity and Applications in the Sequential and Parallel Models
Pebble games are games played on directed acyclic graphs involving placing and moving pebbles on nodes of the graph according to a certain set of rules. The standard pebble game (also known as the black pebble game) is the first of such games played on DAGs. The game itself involves three simple rules: a pebble can be placed on any leaf node (a node without any predecessors), a pebble can be mo...
متن کاملPebblings
The analysis of chessboard pebbling by Andrew Odlyzko is strengthened and generalized, rst to higher dimension and then to arbitrary posets. 1 The pebbling game The pebbling game of Kontsevich is played on the grid points of the rst quadrant. One starts with a single pebble on the origin and a move consists of replacing any pebble with two pebbles, one above and one to the right of the vanishin...
متن کاملSubmitted: June 15, 1994; Accepted: April 5, 1995
The analysis of chessboard pebbling by Andrew Odlyzko is strengthened and generalized, rst to higher dimension and then to arbitrary posets. 1 The pebbling game The pebbling game of Kontsevich is played on the grid points of the rst quadrant. One starts with a single pebble on the origin and a move consists of replacing any pebble with two pebbles, one above and one to the right of the vanishin...
متن کاملPaired-Domination Game Played in Graphs
In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...
متن کامل